Research on Complete Coverage Path Planning Algorithms based on A* Algorithms
نویسندگان
چکیده
The complete coverage path planning algorithm based on A* algorithms for the cleaning robot in known environment is proposed in this paper, which uses A* algorithm as heuristic in the U-turn search algorithm. The idea of this algorithm is the cleaning robot clean the cleaning area from the point of origin by using U-turn algorithm, then planning of the shortest path from cleaning robot to not clean area by using A* algorithm when the robot into the dead nodes, and then the cleaning robot for sweeping along this path to not cleaning area by using U-turn search algorithm until this environment area is all covered. The simulation results show that this algorithm proposed of this paper is high coverage rate and low repetition rate.
منابع مشابه
Study of Evolutionary and Swarm Intelligent Techniques for Soccer Robot Path Planning
Finding an optimal path for a robot in a soccer field involves different parameters such as the positions of the robot, positions of the obstacles, etc. Due to simplicity and smoothness of Ferguson Spline, it has been employed for path planning between arbitrary points on the field in many research teams. In order to optimize the parameters of Ferguson Spline some evolutionary or intelligent al...
متن کاملOn Complete Coverage Path Planning Algorithms for Non-holonomic Mobile Robots: Survey and Challenges
The problem of determining a collision free path within a region is an important area of research in robotics. One significant aspect of this problem is coverage path planning, which is a process to find a path that passes through each reachable position in the desired area. This task is fundamental to many robotic applications such as cleaning, painting, underwater operations, mine sweeping, l...
متن کاملSensor Based Coverage of Unknown Environments for Land Mine Detection
This paper introduces a sensor based coverage algorithm and an overview of a mobile robot system for demining. The algorithm is formulated in terms of critical points which are the points where the topology of an environment changes. We developed a provably complete coverage algorithm which makes a robot pass over all possible points of an unknown environment. Overview of The Coverage Algorithm...
متن کاملDesigning a multi-objective optimization model of Management Canopy, based on genetic algorithms Approach to soil conservation - Case study: Kerman- Roodbar watershed
Reducing the amount and intensity of surface runoff, thus reducing erosion is one of the important aspects of natural resource management, watershed management and soil conservation. Land surface conditions and particularly vegetation is Mitigating or aggravating factor in erosion. Studies on the effect of ground cover to reduce erosion rates indicate that is not necessary to ground cover to re...
متن کاملMobile-robot navigation with complete coverage of unstructured environments
There are some mobile-robot applications that require the complete coverage of an unstructured environment. Examples are humanitarian de-mining and floor-cleaning tasks. A complete-coverage algorithm is then used, a path-planning technique that allows the robot to pass over all points in the environment, avoiding unknown obstacles. Different coverage algorithms exist, but they fail working in u...
متن کامل